Joint Multi-Dimension Pruning via Numerical Gradient Update

نویسندگان

چکیده

We present joint multi-dimension pruning (abbreviated as JointPruning), an effective method of a network on three crucial aspects: spatial, depth and channel simultaneously. To tackle these naturally different dimensions, we proposed general framework by defining seeking the best vector (i.e., numerical value layer-wise number, spacial size, depth) construct unique mapping from to pruned structures. Then optimize with gradient update model optimization process. overcome challenge that there is no explicit function between loss vectors, self-adapted stochastic estimation path through vectors enable efficient update. show strategy discovers better status than previous studies focused individual dimensions solely, our optimized collaboratively across in single end-to-end training it more exhaustive methods. Extensive experiments large-scale ImageNet dataset variety architectures MobileNet V1&V2&V3 ResNet demonstrate effectiveness method. For instance, achieve significant margins 2.5% 2.6% improvement over state-of-the-art approach already compact V1&V2 under extremely large compression ratio.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fast Image Registration via Joint Gradient Maximization: Application to Multi-Modal Data

We present a computationally inexpensive method for multi-modal image registration. Our approach employs a joint gradient similarity function that is applied only to a set high spatial gradient pixels. We obtain motion parameters by maximizing the similarity function by gradient ascent method, which secures a fast convergence. We apply our technique to the task of affine model based registratio...

متن کامل

A new gradient method via least change secant update

The Barzilai–Borwein (BB) gradient method is favourable over the classical steepest descent method both in theory and in real computations. This method takes a 'fixed' step size rather than following a set of line search rules to ensure convergence. Along this line, we present a new approach for the two-point approximation to the quasi-Newton equation within the BB framework on the basis of a w...

متن کامل

Dimension-Free Exponentiated Gradient

I present a new online learning algorithm that extends the exponentiated gradient framework to infinite dimensional spaces. My analysis shows that the algorithm is implicitly able to estimate the L2 norm of the unknown competitor, U , achieving a regret bound of the order of O(U log(U T + 1)) √ T ), instead of the standard O((U + 1) √ T ), achievable without knowing U . For this analysis, I int...

متن کامل

Numerical investigation of dynamic brittle fracture via gradient damage models

Background: Gradient damage models can be acknowledged as a unified framework of dynamic brittle fracture. As a phase-field approach to fracture, they are gaining popularity over the last few years in the computational mechanics community. This paper concentrates on a better understanding of these models. We will highlight their properties during the initiation and propagation phases of defect ...

متن کامل

Characterizing electron temperature gradient turbulence via numerical simulation

Numerical simulations of electron temperature gradient ETG turbulence are presented that characterize the ETG fluctuation spectrum, establish limits to the validity of the adiabatic ion model often employed in studying ETG turbulence, and support the tentative conclusion that plasma-operating regimes exist in which ETG turbulence produces sufficient electron heat transport to be experimentally ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE transactions on image processing

سال: 2021

ISSN: ['1057-7149', '1941-0042']

DOI: https://doi.org/10.1109/tip.2021.3112041